Maximal-entropy random walk unifies centrality measures
نویسندگان
چکیده
منابع مشابه
Maximal-entropy random walk unifies centrality measures
This paper compares a number of centrality measures and several (dis-)similarity matrices with which they can be defined. These matrices, which are used among others in community detection methods, represent quantities connected to enumeration of paths on a graph and to random walks. Relationships between some of these matrices are derived in the paper. These relationships are inherited by the ...
متن کاملMeasures of maximal entropy
We extend the results of Walters on the uniqueness of invariant measures with maximal entropy on compact groups to an arbitrary locally compact group. We show that the maximal entropy is attained at the left Haar measure and the measure of maximal entropy is unique.
متن کاملLocalization of the maximal entropy random walk.
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk loca...
متن کاملMeasures of Maximal Entropy for Random Β-expansions
Let β > 1 be a non-integer. We consider β-expansions of the form ∑∞ i=1 di βi , where the digits (di)i≥1 are generated by means of a random map Kβ defined on {0, 1}N× [0, bβc/(β − 1)]. We show that Kβ has a unique measure νβ of maximal entropy log(1 + bβc). Under this measure, the digits (di)i≥1 form a uniform Bernoulli process, and the projection of this measure on the second coordinate is an ...
متن کاملRandom walk centrality for temporal networks
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, as for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2012
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.86.066109